#include <iostream>
#include <string>
#include <numeric>

using namespace std;

// 1456. 定长子串中元音的最大数目
// https://leetcode.cn/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description/

class Solution {
public:
    int maxVowels(string s, int k) {
        string volwel = "aeiou";
        int ans = 0;
        int cnt = 0;
        int left = 0;
        for (int i = 0; i < s.size(); i++)
        {
            char curCh = s[i];
            if(volwel.find(curCh) != std::string::npos){
                cnt++;
            }
            if(i - left + 1 < k){
                continue;
            }
            ans = max(ans, cnt);
            if (volwel.find(s[left]) != std::string::npos)
            {
                cnt--;
            }
            left++;
        }
        return ans;
    }
};

int main()
{
    return 0;
}